Data-Free Backdoor Removal Based on Channel Lipschitzness

نویسندگان

چکیده

AbstractRecent studies have shown that Deep Neural Networks (DNNs) are vulnerable to the backdoor attacks, which leads malicious behaviors of DNNs when specific triggers attached input images. It was further demonstrated infected possess a collection channels, more sensitive compared with normal channels. Pruning these channels then be effective in mitigating behaviors. To locate those it is natural consider their Lipschitzness, measures sensitivity against worst-case perturbations on inputs. In this work, we introduce novel concept called Channel Lipschitz Constant (CLC), defined as constant mapping from images output each channel. Then provide empirical evidences show strong correlation between an Upper bound CLC (UCLC) and trigger-activated change channel activation. Since UCLC can directly calculated weight matrices, detect potential data-free manner, do simple pruning DNN repair model. The proposed Lipschitzness based (CLP) method super fast, simple, robust choice threshold. Extensive experiments conducted evaluate efficiency effectiveness CLP, achieves state-of-the-art results among mainstream defense methods even without any data. Source codes available at https://github.com/rkteddy/channel-Lipschitzness-based-pruning.KeywordsDeep neural networkBackdoor defenseLipschitz constantModel

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Targeted Backdoor Attacks on Deep Learning Systems Using Data Poisoning

Deep learning models have achieved high performance on many tasks, and thus have been applied to many security-critical scenarios. For example, deep learning-based face recognition systems have been used to authenticate users to access many security-sensitive applications like payment apps. Such usages of deep learning systems provide the adversaries with sufficient incentives to perform attack...

متن کامل

Backdoor Trees

The surprisingly good performance of modern satisfiability (SAT) solvers is usually explained by the existence of a certain “hidden structure” in real-world instances. We introduce the notion of backdoor trees as an indicator for the presence of a hidden structure. Backdoor trees refine the notion of strong backdoor sets, taking into account the relationship between backdoor variables. We prese...

متن کامل

Backdoor Branching

We present an exact Mixed Integer Programming (MIP) solution scheme where a set covering model is used to find a small set of first-choice branching variables. In a preliminary “sampling” phase, our method quickly collects a number of relevant lowcost fractional solutions that qualify as obstacles for the Linear Programming (LP) relaxation bound improvement. Then a set covering model is solved ...

متن کامل

From Horn Strong Backdoor Sets to Ordered Strong Backdoor Sets

Identifying and exploiting hidden problem structures is recognized as a fundamental way to deal with the intractability of combinatorial problems. Recently, a particular structure called (strong) backdoor has been identified in the context of the satisfiability problem. Connections has been established between backdoors and problem hardness leading to a better approximation of the worst case ti...

متن کامل

Coalescence-avoiding joint probabilistic data association based on bias removal

In order to deal with the track coalescence problem of the joint probabilistic data association (JPDA) algorithm, a novel approach from a state bias removal point of view is developed in this paper. The factors that JPDA causes the state bias are analyzed, and the direct computation equation of the bias in the ideal case is given. Then based on the definitions of target detection hypothesis and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2022

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-031-20065-6_11